Closed models, strongly connected components and Euler graphs
نویسندگان
چکیده
منابع مشابه
Finding strongly connected components in distributed graphs
The traditional, serial, algorithm for finding the strongly connected components in a graph is based on depth first search and has complexity which is linear in the size of the graph. Depth first search is difficult to parallelize, which creates a need for a different parallel algorithm for this problem. We describe the implementation of a recently proposed parallel algorithm that finds strongl...
متن کاملTwinless Strongly Connected Components
Tarjan [9], describes how depth first search can be used to identify Strongly Connected Components (SCC) of a directed graph in linear time. It is standard to study Tarjan’s SCC algorithm in most senior undergraduate or introductory graduate computer science algorithms courses. In this paper we introduce the concept of a twinless strongly connected component (TSCC) of a directed graph. Loosely ...
متن کاملMaking Bidirected Graphs Strongly Connected
We consider problems to make a given bidirected graph strongly connected with minimum cardinality of additional signs or additional arcs. For the former problem, we show the minimum number of additional signs and give a linear-time algorithm for finding an optimal solution. For the latter problem, we give a linear-time algorithm for finding a feasible solution whose size is equal to the obvious...
متن کاملStrongly connected components-Algorithm for finding the strongly connected components of a graph
A directed graph G (V, E) is strongly connected if and only if, for any pair of vertices X and Y from V, there exists a path from X to Y and a path from Y to X. In Computer Science, the partition of a graph in strongly connected components is represented by the partition of all vertices from the graph, so that for any two vertices, X and Y, from the same partition, there exists a path from X to...
متن کاملFlipping in Acyclic and Strongly Connected Graphs
A flippable edge in an acyclic digraph is an edge whose reorientation leaves the graph acyclic. We characterize the spanning trees T of an undirected graph G such that there exists an acyclic orientation of G whose set of flippable edges is T . In particular for every edge e ∈ E(G) we give a linear algorithm returning an acyclic orientation and a spanning tree T containing e such that T is the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proyecciones (Antofagasta)
سال: 2016
ISSN: 0716-0917
DOI: 10.4067/s0716-09172016000200001